A cooperative hyper-heuristic search framework
نویسندگان
چکیده
منابع مشابه
A cooperative hyper-heuristic search framework
In this paper, we aim to investigate the role of cooperation between low level heuristics within a hyper-heuristic framework. Since different low level heuristics have different strengths and weaknesses, we believe that cooperation can allow the strengths of one low level heuristic to compensate for the weaknesses of another. We propose an agent-based cooperative hyper-heuristic framework compo...
متن کاملA self-organising hyper-heuristic framework
Hyper-heuristics can be thought of as heuristic management methodologies which are motivated by the goal of building a high level of generality in the scope of computational search methodologies [2] [7]. Most meta-heuristics (and other search methods) perform a search over the solution space directly, whereas, hyper-heuristics as high level strategies search a heuristic space. One of the hyper-...
متن کاملHyperion - A Recursive Hyper-Heuristic Framework
Hyper-heuristics are methodologies used to search the space of heuristics for solving computationally di cult problems. We describe an object-oriented domain analysis for hyper-heuristics that orthogonally decomposes the domain into generative policy components. The framework facilitates the recursive instantiation of hyper-heuristics over hyper-heuristics, allowing further exploration of the p...
متن کاملHySST: Hyper-heuristic Search Strategies and Timetabling
High school timetabling (HST) is a well-known real-world combinatorial optimisation problem. It requires the scheduling of events and resources, such as courses, classes of students, teachers, rooms and more within a fixed number of time slots subject to a set of constraints. In a standard fashion, constraints are separated into ‘hard’ and soft. The hard constraints must be satisfied in order t...
متن کاملGenerating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific subset of instances of a problem. We test the heuristics evolved by GP-HH against well-known local-search heuristics on a variety of benchmark SAT problems. Results are very encouraging.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2009
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-009-9122-6